A New Heuristic Algorithm to Solve the Maximum Independent Set Problem
نویسندگان
چکیده
منابع مشابه
Using critical sets to solve the maximum independent set problem
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent set is developed. The effectiveness of the proposed approach on large graphs with large independence number is demonstrated through extensive numerical experiments.
متن کاملAn Evolutionary Heuristic for the Maximum Independent Set Problem
|The results obtained from the application of a genetic algorithm, GENEsYs, to the NP-complete maximum independent set problem are reported in this work. In contrast to many other genetic algorithm based approaches that use domain-speciic knowledge, the approach presented here relies on a graded penalty term component of the tness function to penalize infeasible solutions. The method is applied...
متن کاملHybrid Heuristic for the Maximum-Weight Independent Set Problem
We propose an approximate algorithm for finding the maximum-weight independent set of a given graph of n nodes with associated weights. It combines three different heuristics, and its running time is O(n2) in the practice. We also propose a set of random graphs for testing and comparing the maximumweight independent set algorithms. This graphs are easy to identically generate on any computer ca...
متن کاملA Hybrid Heuristic Algorithm to Solve Capacitated Location-routing Problem With Fuzzy Demands
In this paper, the capacitated location-routing problem with fuzzy demands (CLRP-FD) is considered. The CLRP-FD is composed of two well-known problems: facility location problem and vehicle routing problem. The problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. In CLRP-FD, a set of c...
متن کاملA new heuristic procedure to solve the Traveling Salesman problem
This paper presents a heuristic technique that uses the Wang Recurrent Neural Network with the "Winner Takes All" principle to solve the Traveling Salesman Problem. When the Wang Neural Network presents solutions for the Assignment Problem with all constraints satisfied, the "Winner Takes All" principle is applied to the values in the Neural Network’s decision variables, with the additional con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computational Applications
سال: 2013
ISSN: 2297-8747
DOI: 10.3390/mca18030495